Fully dynamic algorithm for modular decomposition and recognition of permutation graphs
نویسندگان
چکیده
This paper considers the problem of maintaining a compact representation (O(n) space) of permutation graphs under vertex and edge modifications (insertion or deletion). That representation allows us to answer adjacency queries in O(1) time. The approach is based on a fully dynamic modular decomposition algorithm for permutation graphs that works in O(n) time per edge and vertex modification. We thereby obtain a fully dynamic algorithm for the recognition of permutation graphs.
منابع مشابه
A fully dynamic algorithm for modular decomposition and recognition of cographs
The problem of dynamically recognizing a graph property calls for e ciently decid ing if an input graph satis es the property under repeated modi cations to its set of vertices and edges The input to the problem consists of a series of modi cations to be performed on the graph The objective is to maintain a representation of the graph as long as the property holds and to detect when it ceases t...
متن کاملA Fully Dynamic Algorithm for the Recognition of P4-Sparse Graphs
In this paper, we solve the dynamic recognition problem for the class of P4-sparse graphs: the objective is to handle edge/vertex additions and deletions, to recognizeif each such modification yields a P4-sparse graph, and if yes, to update a representationof the graph. Our approach relies on maintaining the modular decomposition tree of thegraph, which we use for solving the re...
متن کاملFully-Dynamic Recognition Algorithm and Certificate for Directed Cographs
This paper presents an optimal fully-dynamic recognition algorithm for directed cographs. Given the modular decomposition tree of a directed cograph G, the algorithm supports arc and vertex modification (insertion or deletion) in O(d) time where d is the number of arcs involved in the operation. Moreover, if the modified graph remains a directed cograph, the modular tree decomposition is update...
متن کاملGraph decompositions and factorizing permutations
A factorizing permutation of a given graph is simply a permutation of its vertices of which all decomposition sets are factors [3]. Such a concept appears to play a central role in recent papers dealing with graph decomposition. It is applied here for modular decomposition of directed graphs, and we propose a simple linear algorithm that computes the whole decomposition tree when a factorizing ...
متن کاملSplit decomposition and graph-labelled trees: characterizations and fully-dynamic algorithms for totally decomposable graphs
In this paper, we revisit the split decomposition of graphs and give new combinatorial and algorithmic results for the class of totally decomposable graphs, also known as the distance hereditary graphs, and for two non-trivial subclasses, namely the cographs and the 3-leaf power graphs. Precisely, we give strutural and incremental characterizations, leading to optimal fullydynamic recognition a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005